package leetcode.weekly.week299;

//Solution2Test
public class Solution2 {
	// Solution2Test
	int mod = (int) 1e9 + 7;

	public int countHousePlacements(int n) {
		long a = 1, b = 1;
		for (int i = 1; i < n; i++) {
			long a1 = b;
			long b1 = a + b;
			a = a1 % mod;
			b = b1 % mod;
		}
		long max = a + b;
		return (int) (max * max % mod);
	}

	private long find(int n) {
		if (n == 0) {
			return 1;
		}
		return 0;
	}

}
